package BinaryTreePackage2;

/**
 * @author Lzm
 * @version 1.0
 */
public class test {
  public static void main(String[] args) {
    StackAsQueue stackAsQueue = new StackAsQueue();
    stackAsQueue.push(1);
    stackAsQueue.push(2);
    stackAsQueue.push(3);
    System.out.println(stackAsQueue.pop());
    System.out.println(stackAsQueue.pop());
    stackAsQueue.push(4);
    stackAsQueue.push(5);
    System.out.println(stackAsQueue.pop());
    System.out.println(stackAsQueue.pop());


    /*stackAsQueue.push(-1);
    stackAsQueue.push(-2);
    stackAsQueue.push(-3);
    System.out.println(stackAsQueue.pop());
    System.out.println(stackAsQueue.pop());
    System.out.println(stackAsQueue.pop());*/
  }
}
